Efficient k-shot broadcasting in radio networks
نویسندگان
چکیده
منابع مشابه
Efficient k-Shot Broadcasting in Radio Networks
The paper concerns time-efficient k-shot broadcasting in undirected radio networks. In a k-shot broadcasting algorithm, each node in the network is allowed to transmit at most k times. Both known and unknown topology models are considered. For the known topology model, the problem has been studied before by Ga̧sieniec et al. [14], who established an upper bound of D + O(kn1/(k−2) log n) and a lo...
متن کاملOblivious k-shot Broadcasting in Ad Hoc Radio Networks
We study distributed broadcasting protocols with few transmissions (‘shots’) in radio networks of unknown topology. In particular, we examine the case in which a bound k is given and a node may transmit at most k times during the broadcasting protocol. We focus on oblivious algorithms, that is, algorithms where each node decides whether to transmit or not with no consideration of the transmissi...
متن کاملk-shot Broadcasting in Ad Hoc Radio Networks
We study distributed broadcasting protocols with few transmissions (‘shots’) in radio networks where the topology is unknown. In particular, we examine the case in which a bound k is given and a node may transmit at most k times during the broadcasting protocol. Initially, we focus on oblivious algorithms for k-shot broadcasting, that is, algorithms where each node decides whether to transmit o...
متن کاملTime-Efficient Broadcasting in Radio Networks: A Review
Broadcasting is a basic network communication task, where a message initially held by a source node has to be disseminated to all other nodes in the network. Fast algorithms for broadcasting in radio networks have been studied in a wide variety of different models and under different requirements. Some of the main parameters giving rise to the different variants of the problem are the accessibi...
متن کاملEnergy and Time Efficient Broadcasting in Known Topology Radio Networks
The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V,E) where |V | = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.08.021